EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM
نویسندگان
چکیده
منابع مشابه
The quantum query complexity of the abelian hidden subgroup problem
Simon in his FOCS’94 paper was the first to show an exponential gap between classical and quantum computation. The problem he dealt with is now part of a well-studied class of problems, the hidden subgroup problems. We stu<dy Simon’s problem from the point of view of quantum query complexity and give here a first nontrivial lower bound on the query complexity of a hidden subgroup problem, namel...
متن کاملEfficient Quantum Algorithms for the Hidden Subgroup Problem over a Class of Semi-direct Product Groups
In this paper, we consider the hidden subgroup problem (HSP) over the class of semi-direct product groups Zpr ⋊ Zq, for p and q prime. We first present a classification of these groups in five classes. Then, we describe a polynomial-time quantum algorithm solving the HSP over all the groups of one of these classes: the groups of the form Zpr ⋊ Zp, where p is an odd prime. Our algorithm works ev...
متن کاملFrom optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups
We approach the hidden subgroup problem by performing the so-called pretty good measurement on hidden subgroup states. For various groups that can be expressed as the semidirect product of an abelian group and a cyclic group, we show that the pretty good measurement is optimal and that its probability of success and unitary implementation are closely related to an average-case algebraic problem...
متن کاملContinuous Quantum Hidden Subgroup Algorithms
In this paper we show how to construct two continuous variable and one continuous functional quantum hidden subgroup (QHS) algorithms. These are respectively quantum algorithms on the additive group of reals R, the additive group R/Z of the reals Rmod 1, i.e., the circle, and the additive group Paths of L paths x : [0, 1] → R in real n-space R. Also included is a curious discrete QHS algorithm ...
متن کاملPolynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups
We present a family of non-abelian groups for which the hidden subgroup problem can be solved efficiently on a quantum computer. supported by DFG grant GRK 209/3-98
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2003
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054103001996